Fischer decomposition by inframonogenic functions
نویسندگان
چکیده
منابع مشابه
Synthesis and Characterization of Co-Mn Nanocatalyst Prepared by Thermal Decomposition for Fischer-Tropsch Reaction
Nano-structure of Co–Mn spinel oxide was prepared by thermal decomposition method using [Co(NH3)4CO3]MnO4 as the precursor. The properties of the synthesized material were characterized by X-Ray Diffraction (XRD), Brunauer-Emmett-Teller (BET), Transmission Electron Microscopy (TEM), surface area measurements, Energy-Dispersive X-ray (EDX) spectroscopy analys...
متن کاملMaximizing General Set Functions by Submodular Decomposition
We present a branch and bound method for maximizing an arbitrary set function V : 2 θ → R . By decomposing θ as f-δ , where f is a submodular function and δ is the cut function of a (simple, undirected) graph G with vertex set V, our original problem is reduced to a sequence of submodular maximization problems. We characterize a class of submodular functions, which when maximized in the subprob...
متن کاملDecomposition of Boolean Functions Specified by Cubes
We study the problem of decomposing a Boolean function into a set of functions with fewer arguments. This problem has considerable practical importance in VLSI, for example, for designs using field-programmable gate arrays. The decomposition problem is old, and well understood when the function to be decomposed is specified by a truth table, or has one output only. However, modern design tools ...
متن کاملDecomposition of Boolean Functions Speciied by Cubes
We study the problem of decomposing a Boolean function into a set of functions with fewer arguments. This problem has considerable practical importance in VLSI. For example, for digital circuits designed with eld-programmable gate arrays, it is necessary to express Boolean functions in terms of`smaller' functions that t the cells of the array. The decomposition problem is old, and well understo...
متن کاملDecomposition of algebraic functions
Functional decomposition whether a function f x can be written as a composition of functions g h x in a nontrivial way is an important primitive in symbolic computation systems The problem of univariate polynomial decomposition was shown to have an e cient so lution by Kozen and Landau Dickerson and von zur Gathen gave algorithms for certain multivariate cases Zippel showed how to decompose rat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cubo (Temuco)
سال: 2010
ISSN: 0719-0646
DOI: 10.4067/s0719-06462010000200012